Partial period autocorrelations of geometric sequences
نویسندگان
چکیده
For a binary pseudorandom sequence {Si} with period N , the partial period autocorrelation function AS(τ, k,D) is defined by correlating the portion of the sequence within a window of size D, and start position k, with the portion in another window of the same size but starting τ steps later in the sequence. A distribution of possible partial period autocorrelation values is obtained by allowing the start position k to vary over all possible values 0 ≤ k < N . The expectation value is proportional to the periodic autocorrelation function AS(τ). In this paper the variance in the partial period autocorrelation values is estimated for a large class of binary pseudorandom sequences, the so-called “geometric sequences ”. An estimate is given for the minimum window size D which is needed in order to guarantee (with probability of error less than ), that a signal has been synchronized, based on measurement of a single partial period autocorrelation value.
منابع مشابه
Partial period crosscorrelations of geometric sequences
The expectations and variances of partial period cross-correlations for certain geometric sequences are estimated. The expectation of the partial period cross-correlations are shown to be proportional to the periodic cross-correlations. Bounds are found for the variance that show that with high probability the partial period cross-correlations are small if the sequences are balanced.
متن کاملStatistical Properties of the Arithmetic Correlation of Sequences
In this paper we study arithmetic correlations of sequences. Arithmetic correlations are the with-carry analogs of classical correlations. We analyze the arithmetic autocorrelations of non-binary `-sequences, showing that they are nearly optimal. We analyze the expected autoand cross-correlations of sequences with fixed shift, averaged over all seqeunces with a fixed period. We analyze the expe...
متن کاملOn processes with summable partial autocorrelations
A weakly stationary process with summable partial autocorrelations is proved to have one-sided autoregressive and moving average representations. Sums of autocorrelations and alternating autocorrelations are expressed as products of simple rational functions of partial autocorrela-tions. A general bound for sums of squared autocorrelations in terms of partial autocorrelations is also obtained.
متن کاملOn processes with hyperbolically decaying autocorrelations∗
We discuss some relations between autocorrelations (ACF) and partial autocorrelations (PACF) of weakly stationary processes. Firstly, we construct an extension of a process ARIMA(0, d, 0) for d ∈ (−∞, 0), which enjoys nonsummable partial autocorrelations and autocorrelations decaying as rapidly as ρn n−1+2d. Such a situation is impossible if the absolute sum of autocorrelations is sufficiently ...
متن کاملAutocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of p-ary m-Sequence
In modern stream cipher, there are many algorithms, such as ZUC, LTE encryption algorithm and LTE integrity algorithm, using bit-component sequences of p-ary m-sequences as the input of the algorithm. Therefore, analyzing their statistical property (For example, autocorrelation, linear complexity and 2-adic complexity) of bit-component sequences of p-ary m-sequences is becoming an important res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 40 شماره
صفحات -
تاریخ انتشار 1994